Extended errors correcting device having single package error correcting and double package error detecting codes

ABSTRACT

An apparatus and method for correcting data words from a memory is provided in which coded data is divided into a plurality of multi-bit packages of b bits each. The coded data comprises n-bit words with r error correcting code bits and n-r data bits. The invention is capable of correcting one package which has suffered at least one hard failure and a single soft error located in a different package. The invention involves the use of an error correcting code which gives a first syndrome when the data word has suffered a first error coming from at least one error in a first package and a single error in a different second package, which also gives a second syndrome when the data word has suffered a second error coming from at least one error in the above first package, and a single error in a third package. The error correcting code is such that equality of the first and second syndromes results in the equality of the first and second errors.

Technical Field of the Invention

The present invention relates generally to error correction. It relates in particular, to the correction of a soft error beyond the unextended capability of the error correction code being used.

Background Art

As the size of computer memories has increased while the individual memory cells have become further miniaturized, there has resulted an unacceptable occurrence of bit errors in data stored in a memory. No longer can an occasional error be allowed to cause a program to stop operating or require replacement of a memory chip. These bit errors are of two general types, soft errors and hard errors.

A soft error is a seemingly random inversion of stored data. This inversion is caused by occasional bursts of electrical noise and, in some cases, by atomic particles, the so-called alpha particle upset. The soft error problem has increased as the individual cell sizes have been reduced so that noise levels represent relatively low amounts of power.

A hard error, in contrast, represents a permanent electrical failure of the memory chip, often restricted to particular memory locations but also sometimes associated with peripheral circuitry of the memory chip so that the entire chip can be affected. Naturally, designers of memory chips have striven to reduce the occurrence of both hard and soft errors in their chips. However, both types of errors have not been completely eliminated and, indeed, it is not believed that they can be eliminated. Reliability beyond a certain point can be bought only at the expense of reduced performance or increased cost.

An alternative to the above solution for both hard and soft errors has been the implementation of error correction codes (ECC) in large computer memories. The fundamentals of error detecting and correcting are described by R.W. Hamming in a technical article titled "Error detecting and error correcting codes" appearing in the Bell System Technical Journal, Volume 26, No. 2, 1950 at pages 147-160. In one of the most popular Hamming codes, an 8 bit data word is encoded to a 13-bit word according to a selected Hamming code. The described code is classified as SEC/DEC (single error correct/double error detect). However, since a SEC/DED Hamming code can correct only a single random error (either soft or hard) occurring in any byte, more elaborate error correcting codes have been developed and implemented.

In particular, a better procedure has been developed for dealing with hard errors in multi-bit packages. These errors are referred to as package errors and the error correction codes designed specifically for package errors will be called package codes. The codes rely upon the fact that multiple hard errors do not randomly occur across the entire field of the data word. Instead, multiple hard errors are confined to a sub-field of the data word, defined by the outputs of the package. In the context of a 256K×4 memory chip, consisting of a 1 megabit memory chip adapted to have 4 data ports simultaneously accessible, such a code cannot correct any four errors occurring in 32 bits. However, the code can correct four-bit errors that occur in any one of eight 4-bit sub-fields.

Nonetheless, even such codes are not completely satisfactory. If the code is a SPC/DPD (single package correct/double package detect) code, then the code can correct any errors that occur in only one package and can detect, but not correct, errors occurring in two packages. Thus if one package has suffered a hard failure, the occurrence of any additional errors, either soft or hard, in the remaining packages means that the error condition can be detected but the errors cannot be corrected. The existence of one hard failure is the effective limit of correction provided by a SPC/DPD code.

In U.S. Pat. No. 4,661,955 there are cited examples of package codes and their hardware implementation in the background art. This document also discloses a digital error detection and correction apparatus particularly applicable to a code that can correct any number of errors in one sub-field but can only detect the existence of any number of errors in two sub-fields. If the initial pass of the data through the error correction code indicates an uncorrected error, the data is complemented and restored in the memory and then reread. The retrieved data is recomplemented and again passed through the error correction code. If an uncorrected error persists, then a bit-by-bit comparison is performed between the originally read data and the retrieved complemented data to isolate the hard failure in the memory. The bits in the sub-field associated with the hard failure are then sequentially changed and then the changed data word is passed through the error correction code. A wrong combination is detected by the error correction code. The sub-field associated with the hard failure matches the originally stored data, in which case the error correction code can correct the remaining errors in the remaining sub-fields. However, the successive changes of the bits in the sub-field associated with the hard failure involve a long process of iterations. Moreover, this system has the disadvantage of involving a long process of bit by bit comparisons between the originally read data and the retrieved complemented ones, numerous compare circuits and latches, and a non-fixed length correcting sequence since the originally stored data in a sub-field associated with the hard fail can be any of the 16 different combinations.

Summary of the Invention

It is an object of the invention to provide a simple and low cost extended error correcting device and method for single package error correcting and double package error detecting codes capable of correcting both a single error in one package and errors in an other package, at least one of which is a hard error.

It is an other object of the invention to provide an extending error correcting device involving a short fixed correcting sequence.

It is a further object of the invention to provide an extended error correcting device for correcting a soft error with an ECC designed to correct package error in an n-bit-per-package memory organization.

The objects of the invention are achieved by means of the digital error detection and correction apparatus of the invention for correcting n-bit data words comprising a field of n-r data bits and a field of r error-correcting-code bits according to an error correcting code. The n-bit data words are organized in packages of b bits, and the invention is capable of correcting one package having suffered at least one hard failure and a single soft error located in a different package. The apparatus of the invention involves an error correcting code which gives a first syndrome when the data word has suffered a first error coming from at least one error in a first package and a single error in a second package different from the first package, which also gives a second syndrome when the data word has suffered a second error coming from at least one error in the above first package, and a single error in a third package. The error correcting code is such that the equality of the above first and second syndromes results in the equality of the first and second errors. The apparatus of the invention further includes means for storing the syndrome of a first data word v, and means for adding the syndrome of a second data word v', the latter data word v' being generated from the first data word v by means of an "invert write" and an "invert read" procedure. The above addition allows the masking of the single soft error. The invention further includes means for determining whether the result of the above addition provides a syndrome characterizing a single package syndrome, in order to determine the number of the package having suffered at least one hard error, and means operative in response to said determination for directly locating the positions of the errors, either soft or hard, in order to correct the originally stored data word.

Description of the Drawings

The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of practice, together with the further objects and advantages thereof, may best be understood by reference to the following description taken in connection with the accompanying drawings in which:

FIG. 1 describes a table listing all possible syndromes that result when errors have occurred in the first package and a single bit error has occurred in an other package;

FIGS. 2 to 11 are respectively tables listing all possible syndromes that result when errors have occurred in respectively the second to the eleventh package and a single bit error has occurred in an other package;

FIG. 12 is a flow chart describing the different steps involved with the error correcting system of the invention in order to correct a single soft error in the presence of a hard error;

FIGS. 13a and FIG. 13b are partial views illustrating an example of a preferred embodiment of the invention; and

FIG. 14 is a view detailing the way to assemble FIGS. 13a and 13b.

Description of the Invention

The extended error correcting device according to the invention is based both on an "invert and retry procedure" and an analysis of the syndrome, the latter also being called the "parity check vector" or "corrector". The "invert and retry" consists in inverting the word so that the hard failure matches the electrical level to store (the hard error is masked) allowing the correction of the soft error before the word is restored with its original polarity. The "invert and retry" procedure is particularly used in the error correcting device of the invention to locate a first failed package in the word containing at least an error of the hard type. Analysis of the different syndromes eventually and immediately determine the single soft error that has occurred in a second package. Consider the following Reed-Solomon code, characterized by the r x n parity-check H matrix hereinafter, and let us illustrate an embodiment of the invention involving a 4 bit per package memory organization for 32 bit data words (r=12, n=44).

The H matrix is: ##EQU1## The developed H matrix is therefore:

    __________________________________________________________________________     PACKAGE NUMBER                                                                    2  3  4  5  6  7  8  9  10 11 COMMENTS                                      __________________________________________________________________________      ##STR1##                                                                          ##STR2##                                                                          ##STR3##                                                                          ##STR4##                                                                          ##STR5##                                                                          ##STR6##                                                                          ##STR7##                                                                          ##STR8##                                                                          ##STR9##                                                                          ##STR10##                                                                         ##STR11##                                                                        Bits 1-32 are data bits Bits 33-34 are                                         ECC bits                                       ##STR12##                                                                         ##STR13##                                                                         ##STR14##                                                                         ##STR15##                                                                         ##STR16##                                                                         ##STR17##                                                                         ##STR18##                                                                         ##STR19##                                                                         ##STR20##                                                                         ##STR21##                                                                         ##STR22##                                        ##STR23##                                                                         ##STR24##                                                                         ##STR25##                                                                         ##STR26##                                                                         ##STR27##                                                                         ##STR28##                                                                         ##STR29##                                                                         ##STR30##                                                                         ##STR31##                                                                         ##STR32##                                                                         ##STR33##                                              111                                                                              1111                                                                              1112                                                                              2222                                                                              2222                                                                              2333                                                                              3333                                                                              3334                                                                              4444                                                                              Bit Index                                     1234                                                                              5678                                                                              9012                                                                              3456                                                                              7890                                                                              1234                                                                              5678                                                                              9012                                                                              3456                                                                              7890                                                                              1234                                             __________________________________________________________________________

A vector V=(a₁, a₂, a₃, ... a_(n)) is a code word if and only if its associated syndrome S(v)=v H^(T), an r component vector, is null. In the reverse case, the preceding syndrome is not null. If a vector u, being a code word, is transmitted and v is received, the syndrome of v can be calculated by the following relation:

S(v)=S(u)+S(v+u) due to the linear property of metrical operations, in which the addition table of each binary element is given in the following:

    ______________________________________                                         +                0     1                                                       0                0     1                                                       1                1     0                                                       ______________________________________                                    

this means that S(v)=S(v+u) since S(u)=0.

Therefore, any syndrome may be calculated from the pattern error v-u and in particular, all syndromes corresponding to single package errors.

    __________________________________________________________________________     SYNDROMES OF SINGLE PACKAGE ERRORS                                             (11 packages × 15 types of error                                         possible within a package = 165)                                               Package                                                                        in   Bits in Error within the package in HexaDecimal notation:                 error                                                                               1  2  3  4  5  6  7  8  9  A   B  C  D   E  F                             __________________________________________________________________________     1    111                                                                               222                                                                               333                                                                               444                                                                               555                                                                               666                                                                               777                                                                               888                                                                               999                                                                               AAA BBB                                                                               CCC                                                                               DDD EEE                                                                               FFF                           2    1C6                                                                               21C                                                                               3DA                                                                               421                                                                               5E7                                                                               63D                                                                               7FB                                                                               842                                                                               984                                                                               A5E B98                                                                               C63                                                                               DA5 E7F                                                                               FB9                           3    16D                                                                               2C3                                                                               3AE                                                                               416                                                                               57B                                                                               6D5                                                                               7B8                                                                               82C                                                                               941                                                                               AEF B82                                                                               C3A                                                                               D57 EF9                                                                               F94                           4    135                                                                               26A                                                                               35F                                                                               4CD                                                                               5F8                                                                               6A7                                                                               792                                                                               813                                                                               926                                                                               A79 B4C                                                                               CDE                                                                               DEB EB4                                                                               F81                           5    1D7                                                                               23E                                                                               3E9                                                                               465                                                                               5B2                                                                               65B                                                                               78C                                                                               8CA                                                                               91D                                                                               AF4 B23                                                                               CAF                                                                               D78 E91                                                                               F46                           6    1AB                                                                               2DF                                                                               374                                                                               437                                                                               59C                                                                               6E8                                                                               743                                                                               86E                                                                               9C5                                                                               AB1 B1A                                                                               C59                                                                               DF2 E86                                                                               F2D                           7    158                                                                               2A9                                                                               3F1                                                                               4DB                                                                               583                                                                               672                                                                               72A                                                                               83F                                                                               967                                                                               A96 BCE                                                                               CE4                                                                               DBC E4D                                                                               F15                           8    1E2                                                                               254                                                                               3B6                                                                               4A8                                                                               54A                                                                               6FC                                                                               71E                                                                               8D9                                                                               93B                                                                               A8D B6F                                                                               C71                                                                               D93 E25                                                                               FC7                           9    100                                                                               200                                                                               300                                                                               400                                                                               500                                                                               600                                                                               700                                                                               800                                                                               900                                                                               A00 B00                                                                               C00                                                                               D00 E00                                                                               F00                           10   010                                                                               020                                                                               030                                                                               040                                                                               050                                                                               060                                                                               070                                                                               080                                                                               090                                                                               0A0 0B0                                                                               0C0                                                                               0D0 0E0                                                                               0F0                           11   001                                                                               002                                                                               003                                                                               004                                                                               005                                                                               006                                                                               007                                                                               008                                                                               009                                                                               00A 00B                                                                               00C                                                                               00D 00E                                                                               00F                           __________________________________________________________________________

It should be noticed that these syndromes, characterizing single package errors are unique in order to indicate in an unambiguous way the package to correct and the bits in error within a package. For instance, if the evaluated syndrome S(v) has the hexadecimal value '7B8' (in binary '0111 1011 1000'), the above table reveals that the error pattern is equal to:

    v+u=  0000 0000 0111 0000 0000 0000 0000 0000 0000 0000 0000.

In other words, the three last bits of the third 4-bit package have suffered an inversion, and should be re-inverted in order to restore the original data word u.

Similarly, it is possible to list all syndromes that result when a package error is aligned with a single bit error in another one. The result may be listed in 11 tables, each table corresponding to a given package having suffered errors.

FIG. 1 is a table listing all possible syndromes that result when errors have occurred in the first package and a single bit error has occurred in an other package.

FIGS. 2 to 11 are tables listing all possible syndromes that result when errors have occurred in respectively the second to the eleventh package and a single bit error has occurred in an other package. Obviously, the syndromes of the double package errors listed in the tables of FIGS. 1 to 11, though they are not unique, are all differences of the syndromes of the single package errors listed above, which allows the distinction between an immediately correctable single package error and a double package error not correctable by a SPC/DPD code. However, the use of the particular H matrix above defined, in order to achieve the SPC/DPD code entails an additional advantage: within any of the tables of FIGS. 1 to 11, the syndromes of a double package errors are unique. Consequently, the knowledge of a package having suffered numerous errors, i.e. the reference number of the table of FIGS. 1 to 11, permits the additional single error, having occurred in an other package, to be located. For instance, let us suppose that double package errors have occurred in the data word, with numerous errors affecting package n₁. Assuming that the result of the calculation of the syndrome gives the value 'F64', the reading of table of the FIG. 1 indicates that the hexadecimal notation of the erroneous bits within package 1 is '7' (' 0111' in binary ), and that a single error has affected bit 13. The pattern error is then:

    v+u=0111 0000 0000 1000 0000 0000 0000 0000 0000 0000 0000.

FIG. 12 is a flow chart describing the different steps involving the error correcting system of the invention in order to correct a single soft error in presence of a hard error package. A data word u, which has been encoded according to the SPC/DPD Reed-Solomon code above and stored in its proper location A in a memory, is read from the designated location A, step 1. Since this location may have suffered some failures, either soft or hard, the read word v may differ from the word u originally stored at the designated location. The syndrome S(v) corresponding to the read word v is then evaluated (step 2), and checked in order to determine whether it is null or it corresponds to a single package error (SPE). If the read word v contains no errors (S(v)=0), or if it contains errors restricted to a single package (S(v) is one among the SPE listed above), then there will be no uncorrected errors since the SPC/DPD Reed-Solomon code can immediately correct all the errors in the failed package, step 13. In this case the access is complete because either the read word v is correct or has been corrected and the corrected word v can be used. The above procedure is usual ECC processing.

If, however, there are errors in two different packages, the ECC procedure based on the SPC/DPD can only indicate the existence of this condition and cannot correct. The above evaluated syndrome S(v) is stored in order to perform the extended errors correction processing of the invention, step 3. Steps 4 and 5 are common and well known "invert write" and "invert read" procedures. Such procedures are recalled in the already cited U.S. Pat. No. 4,661,955. Basically, the read data word v is inverted to its complement value and the complemented value is then stored back into its corresponding location A, step 4. Then, the same location is read and the retrieved data word is inverted to its complemented value in order to generate a data word v', step 5. The value of v' should equal the value of v because of the two intervening inversions. However, if the memory has suffered a hard failure such that a bit position is stuck either high or low regardless of the input value to that bit, then v' does not equal v. Therefore, after the steps 4 and 5, the stuck bit positions which formerly carried a wrong binary information, now carry a correct binary information, whereas the contrary occurs for those which carried correct binary information. As a result, the situations can be met wherein the number of stuck bits carrying the correct information is greater than the number of stuck bits carrying the wrong information. In such a case, the syndrome of v', S(v'), may be found to be null or one among the single package error syndromes listed above (step 5), in which case the process progresses to step 6 in order to correct the data word v' since the error correcting Reed-Solomon code can handle single package errors. The regenerated value of the originally stored data word u is then immediately restored in the designated location A in memory because one of the errors so detected may have been a soft error. Soft errors do not indicate a bad memory location but only that some data is temporarily inverted at that location. Once the data has been correctly restored at that location, it is highly unlikely that it will reinvert. Since soft errors may accumulate to the point that they become too numerous in any word to correct, it is advisable to correct any soft error as soon as it is detected.

If, however, the evaluated syndrome of v' is neither null nor one among the SPE syndromes listed above, the process progresses to step 7, where the syndrome of v stored at step 3 and the the syndrome of v' are added. Because of the following relation:

S(v)+S(v')=S(v+u)+S(v'+u)=S((v+u)+(v'+u)),

one may notice that the sum of the two syndromes S(v) and S(v') is function of both pattern errors v+u and v'+u. Since the the "invert write" and "invert read" procedures of steps 4 and 5 do not affect any soft error, the addition of pattern errors v+u and v'+u will mask the presence of those.

Assuming for instance that the pattern error v+u is:

    v+u=0101 0000 0000 1000 0000 0000 0000 0000 0000 0000 0000

which means that the received word v differs from the originally stored word u by the second, the fourth and the thirteen bit. Assuming moreover, that the three last bit of the first package are stuck (hard error package) and that the 13th bit has suffered a soft error, the processing of word v by steps 4 and 5 give a data word v' such that its corresponding pattern error is

    v'+u=0010 0000 0000 1000 0000 0000 0000 0000 0000 0000 0000.

Therefore, data word v' differs from the originally stored word u by its third and thirteen bit. Consequently, the formerly second and fourth bits of the data word v which were wrong, have now been corrected, but conversely, the third bit, which was originally carrying the right binary information, has also been inverted. However, the process of steps 4 and 5 did not affect the validity of bit thirteen, as mentioned previously.

The addition of both preceding pattern errors v+u and v'+u will mask the soft error:

    (v+u)+(v'+u)=0111 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000.

Consequently, the syndrome of the sum of the two pattern errors v+u and v'+u is one among the SPE syndromes listed in the table above, the reading of which will allow the determination of the package which has suffered a hard package error. With respect to the preceding example, the evaluation of the two syndromes gives:

    S(v)='D46' (hexadecimal)=1101 0100 0110 (binary)

    S(v')='A31' (hexadecimal)=1010 0011 0001 (binary)

Consequently,

    S(v)+S(v') is equal to='777' (hexadecimal)=0111 0111 0111 (binary)

The reading of the table thus indicates that the first package has suffered a hard package error, and more accurately that the three last bit positions of the first package are stuck (value '7' in hexadecimal).

According to the preceding discussion, the process performs at step 8 a test in order to determine if the sum of S(v) and S(v') is a DPE syndrome or not. In such a case, it is assumed that the ECC had initially detected errors in three or more packages or that more than soft errors have occurred. The described embodiment is incapable of handling such situations and an uncorrected error is flagged.

If however, the sum syndrome appears to be a SPE syndrome, the process progresses to step 9 in which the location of the hard error package is achieved by reading the table given above. Then, according to the result of step 9, the syndrome of the word v is read in step 10 into one among the tables of FIGS. 1 to 11 in order to find its corresponding error pattern v+u. This allows the original data word u to be restored into the designated location A in the memory step 11, and the correct word can eventually be used.

The above process gives a satisfactory result every time a single soft error in one package coexists with errors, one of which is a hard error, confined to a second package. Now, considering the fact that the hard errors are most often located in a unique package, while the soft errors seldom affect the same data word since they are randomly located within the memory, the extended error correction device according to the invention will be able to handle most of the double package errors with only a SPC/DPD ECC. Moreover, this result is achieved without requiring a bit by bit comparison between the original read data and the retrieved complemented ones as described in U.S. Pat. No. 4,661,955. Also, no sequential change of the bits within the sub-field is needed, and the extended error correcting device of the invention involves a short fixed length correcting sequence.

FIGS. 13a and 13b are partial views illustrating an example of a preferred embodiment of the invention. FIG. 14 shows how to join those two figures. With respect to FIG. 13a, the preferred embodiment of the invention includes "SPE decode" logic 20 connected to a 12-bit-bus 28 and to a 12-bit-b-us 29. 12-bit bus 28 carries the 12-bit-syndrome evaluated by a "Syndrome Decode" circuit 26, and is connected to a first input of a "Sum Syndrome" circuit 24 and to the input of a "Syndrome Register" 25. Syndrome Register 25 is controlled by a signal line 34 and has a 12-bit-output bus 30 connected to a second input of Sum Syndrome circuit 24. 12-bit- bus 28 is also connected to the 12most significant bits (MSB) of address bus 35 of storage 21. The 4 least significant bits (LSB) of address bus 35 of storage 21 are connected through 4-bit-bus 31 to the output of coder 23. Coder 23 has an input connected to 11-bit-bus 90 which is connected to a first output of SPE decode circuit 20 and which carries the number of the package containing hard errors. SPE decode circuit 20 has a second output bus 33 which is a 4-bit-bus carrying the positions of the faulty bits in the package referenced by the value carried by 11-bit-bus 90. A set of latches 27 is used to store the 44-bit-data word v or v' extracted from location A, and has an output bus 70 connected to the input of Syndrome Decode circuit 26. The output of Sum Syndrome circuit 24 carrying the sum of the syndromes on busses 28 and 30, is connected to 12-bit-bus 29 in order to be transmitted to SPE decode circuit 20. The output of storage 21 carrying the data word corresponding to the address appearing on bus 35 (i.e. busses 28 and 31), is sent to a decoder circuit 22 via bus 32. Decoder 22 decodes the value carried by 6-bit-bus 32 and activates one among the 44 leads of a 44-bit-bus 80. Decoder 22 has control lead 36 which, when raised to a high level, blocks the 44 leads on bus 80 at a low level.

With respect to FIG. 13b, the preferred embodiment of the invention further includes a set of 44 XOR gates 44-XX (with ranging from 01 to 44), the output of each of which carries one among the 44 bits of the recovered original data word u, when the correction of the input data word v has been possible. The 44 XOR gates are divided into 11 packages of 4XOR gates, and in accordance with the division of the 44 bits of the data word into 11 packages of 4 bits illustrated above.

For clarity purpose, only XOR gates 40-01, 40-02, 40-03, 40-04, 40-05, 40-06, 40-07, 40-08, 40-41, 40-42, 40-43, 40-44 (first, second and eleventh package) have been represented. Every XOR gate 40-XX (with XX=01 to 44) has a first input connected to the XX^(th) lead of 44-bit-bus 70 carrying the input data word v or v' as will be described hereinafter. For instance, XOR gate 40-01 has its first input connected to the first lead of bus 70. Similarly, XOR gate 40-44 has its first input connected to the 44^(th) lead of bus 70. Every XOR gate 40-XX (with XX=01 to 44) has a second input connected to the output of an OR gate 50-XX (with XX=01 to 44). For instance, XOR gate 40-01 has its second input connected to the output of OR gate 50-01. Also, XOR gate 40-42 has its second input connected to the output of OR gate 50-42. Every OR gate 50-XX (with XX=01 to 44) has a first input connected to the XX^(th) lead of 44-bit-bus 80 carrying the decoded output of storage 21. For instance, OR gate 50-01 has its first input connected to the first lead of bus 80. Similarly, OR gate 50-41 has its first input connected to the 41th lead of bus 80.

Every OR gate 50-XX (with XX=01 to 44) has a second input connected to the output of an AND gate 60-XX (with XX=01 to 44). For instance, OR gate 50-01 has its second input connected to the output of AND gate 60-01. Also, OR gate 50-42 has its second input connected to the output of AND gate 60-42. Similar to the above, the 44 AND gates are divided into 11 packages of 4 AND gates each. (For instance, the first package comprises gates 60-01, 60-02, 60-03 and 60-04 or the third package comprises gates 60-09, 60-10, 60-11 and 60-12...). All AND gates 60-XX, 60-(XX+1), 60-(XX+2), 60-(XX+3) (with XX=4*n+1 with n=0 to 10) of a given package among the 11 possible packages, have their first input connected together to the n^(th) lead of 11-bit bus 90 controlled by SPE decode circuit 20 (as shown in FIG. 13a). For instance AND gates 60-01, 60-02, 60-03, 60-14 of the first package have their first input connected together to the first lead of bus 90. Every AND gate 60-XX (with XX=1 to 41 modulo 4) has a second second input connected to the first lead of 4-bit bus 33 carrying the value of the bits to correct within the hard error package determined by the value carried on bus 90.

Every AND gate 60-XX (with XX=2 to 42 modulo 4) has a second second input connected to the second lead of 4-bit bus 33.

Every AND gate 60-XX (with XX=3 to 43 modulo 4) has a second second input connected to the third lead of 4-bit bus 33.

Every AND gate 60-XX (with XX=4 to 44 modulo 4) has a second second input connected to the fourth lead of 4-bit bus 33.

Storage 21 is typically a Read Only Storage (ROS) memory which, when addressed by a word consisting of both the syndrome S(v) and a 4-bit word representative of the number of the hard error package, delivers a 6-bit data word allowing the control of OR gates 50-XX (with XX=01 to 44) via decoder 22. In this way, the reading of the tables of FIGS. 1 to 11 is immediate, and is implemented advantageously. However, it should be noticed that the reading of those tables can be achieved by means of other well known techniques, such as the use of a programmable logic array (PLA), or some combinatory logic. Particularly, storage 21 has been programmed in such a way that any SPE syndrome, or null syndrome appearing on bus 28, i.e. the 12 most significant bits of address bus 35, entails the extraction of a 6-bit word that sets all leads of bus 80 to a low level.

The extended error correction device according to the invention operates in the following way: The data word v extracted from its designated location is first stored in the set of latches 27. Syndrome Decode circuit 26 evaluates, from the 44-bit data word v, a 12-bit syndrome S(v). Syndrome Decode circuit 26 basically comprises combinatory logic which is well known to a person skilled in the art. Control line 34 is raised to a high level which entails the storage of the syndrome into syndrome register 25. SPE decode circuit 20 receiving the value of S(v) on 12-bit bus 28, decodes S(v) in order to determine whether S(v) is null or one among the SPE syndromes listed above, according to step 2 of FIG. 12.

If S(v) is found to be null, SPE decode circuit 20 generates a low level on each lead of bus 90 in order to put every AND gate 60-XX (with XX=01 to 44) at a low level. The appearance of an SPE syndrome at the most significant bits of address bus of storage 21 entails, as mentioned previously, the extraction of a 6-bit data word on bus 32 which sets all lines of the 44-bit bus 80 to a low level. In this case, control lead 36 is set to a low level. Consequently, every OR gate 50-XX (with XX=01 to 44) is set to a low level and the input data word v carried by bus 70 and recognized to be without any error, is transmitted to the output of error correcting device via XOR gates 40-XX (with XX=01 to 44). If S(v) is found to be one among the SPE syndromes listed above, SPE decode circuit 20 generates a high level on the line of bus 90 which corresponds to the package having suffered a failure, thus activating the first inputs of all of the AND gates of the package corresponding to the designated failed package. Similarly, SPE Decode circuit 20 activates on bus 33, the lines corresponding to the position of the bits within the failed package which should be re-inverted in order to restore the original data word u. The AND gates associated with the positions of the bits carrying wrong information are consequently set to a high level. Since the most significant bits of address bus 35 carry an SPE syndrome, as previously, a 6-bit word is extracted from storage 21 which set to a low level all leads of bus 80, and thus the first input of every OR gate 50-XX (with XX =01 to 44). The 0R gates corresponding to the positions of the bits within the failed package which should be re-inverted are consequently set to a high state. This results in the final inversion of the corresponding bits by means of the corresponding XOR gates.

With respect to a preceding example, if the syndrome of the input data word v is equal to '7B8' (the preceding table indicates that the third package has suffered an error, and particularly, the last three bits of this package), SPE Decode circuit 20 raises the third line of bus 90 which prevents the activation of any AND gate 60-XX excepting those of package 3, i.e. AND gates 60-09, 60-10, 60-11 and 60-12. SPE Decode circuit 20 also activates lines 2, 3 and 4 of bus 33, which sets AND gates 60-10, 60-11 and 60-12 to a high state. Since the most significant bits of address bus 35 carries the value of an SPE syndrome, the data extracted from storage 21 on 6-bit bus 32 is such that any lead of bus 80 is set to a low level. Therefore, only OR gates 50-10, 50-11 and 50-12 are set to a high level, which allows the inversion of bits 10, 11 and 12 of the input data word v by means of XOR gates 40-10, 40-11 and 40-12.

If the evaluated syndrome S(v) is not null nor included in the table above, the already mentioned "invert write" and "invert read" procedures are performed according to steps 4 and 5 of FIG. 12. The resulting data word v' is transmitted to the input of latches 27, the syndrome of which is evaluated by Syndrome Decode circuit 26. Control line 34 is set to a low level, which prevents the storage of the new syndrome into Syndrome Register 25. Decode circuit 20 receiving this new syndrome S(v') on bus 28 determines whether S(v') is null or one among the SPE syndromes listed above.

If S(v') is found to be null, SPE Decode circuit 20 generates a low level on each line of bus 90 in order to put every AND gate 60-XX (with XX=01 to 44) at a low level. Since control lead 36 is set at a high level, all leads of the 44-bit bus 80, and thus the first input lead of every 0R gate 50-XX, are set to a low level. Consequently, every 0R gate 50-XX (with XX=01 to 44) is set to a low level and the input data word v' carried by bus 70 and recognized to be without any error, is transmitted to the output of the error correcting apparatus via XOR gates 40-XX (with XX=01 to 44).

If S(v') is found to be one among the SPE syndromes listed above, SPE Decode circuit 20 generates a high level on the line of bus 90 which corresponds to the package having suffered a failure, thus activating the first inputs of all the AND gates of the package corresponding to the designated failed package. Similarly, SPE Decode circuit 20 activates, on bus 33, the lines corresponding to the position of the bits within the failed package which should be re-inverted in order to correct the word v' and to restore the original data word u. The AND gates associated with the positions of the bits carrying wrong information are consequently set to a high level. Since control line 36 remains at a high level, every line of bus 80 and consequently every first input of OR gate 50-XX (with XX =01 to 44), is set to a low level. As a result, the OR gates corresponding to the positions of the bits carrying wrong binary information are set to a high level, thus resulting in the inversion of the corresponding bits by means of the associated XOR gates. It should be noted that the signal existing on control line 36 can be generated by a simple sequential logic circuit or other control logic circuitry which is well known in the art.

This completes the ECC processing upon the word v' according to step 14 of FIG. 12.

If S(v') appearing on bus 28, is neither equal to one among the SPE syndromes nor null, SPE Decode circuit 20 reads the value of the sum of syndromes S(v) and S(v') on bus 29 according to step 7 of FIG. 12. If the value carried on bus 29 is not one among the SPE syndromes, the process is completed by flagging an uncorrectable error according to step 8 of FIG. 12, since the invention is incapable of handling such situations.

If S(v') +S(v) is found to be one among the SPE syndromes listed above, SPE Decode circuit 20 generates a high level on the line of bus 90 which corresponds to the package having suffered a hard failure, thus activating the first inputs of all the AND gates of the package corresponding to the designated failed package. SPE Decode circuit 20 sets at a low level every line of bus 33, thus blocking every AND gate 60-XX (with XX =01 to 44)-. Control line 36 is set to a low level. Consequently, Decoder 22 controls every line of bus 80 according to the content of the 6-bit data word extracted from storage 21. Since the least significant bits of address bus 35 carry the number of the faulty package, and since the most significant bits of address bus 34 carries the value of the evaluated syndrome S(v'), the storage can immediately deliver via bus 80, the position of the bits to invert in order to correct the data word v' and to restore the original data word u.

While the preferred embodiment of the invention has been particularly described with respect to the preceding particular Reed-Solomon code, it should be noticed that the invention is not restricted to that case. The size of the data word, a 44 bit size, can easily be extended. For instance, 72-bit data words having 60 (15×4) data bits and 12 (3×4) ECC bits. In such a case, the uniqueness of the syndromes of a single package error associated with a single bit error is still assured for a given faulty package number.

A different way of generating a Reed-Solomon code is to use another T matrix. It should be noticed that the T matrix must be the companion matrix of a primitive element of a Galois Field GF(2^(b)). The case described above was with respect to the companion matrix with b=4. In particular, the following T matrix may be used:

    ______________________________________                                         0001                                                                           1000                                                                           0100                                                                           0011                                                                           ______________________________________                                    

The extended error correcting device of the invention may also be implemented with a different b value, for instance with b=3. As for b=4, only two distinctive T matrices, and thus two distinctive H matrices can e used (30,21). Those two T matrices are: ##EQU2## While the invention has been described in detail herein in accord with certain preferred embodiments thereof, many modifications and changes therein may be effected by those skilled in the art. Accordingly, it is intended by the appended claims to cover all such modifications and changes as fall within the true spirit and scope of the invention. 

What is claimed is:
 1. A digital error detection and correction apparatus for correcting an n-bit data word stored in a memory of an information processing system, said data word comprising a field of n-r data bits and a field of r error correcting code bits according to an error correcting code, said n-bit data words being organized in packages of b bits, said code being capable of correcting at least one error in one package having suffered at least one hard failure and a single soft error in a different package, said apparatus comprising:syndrome generating means in which said error correcting code produces a first syndrome upon the condition that said data word suffers a first error due to at least one error in a first package and a single error in a second package, said second package being different from said first package, and in which said code produces a second syndrome upon the condition that said data word suffers a second error due to at least one error in said first package and a single error in a third package, said syndrome generating means also being responsive to an error correcting code in which the equality of said first and second syndromes results in the equality of said first and second errors; means for storing the syndrome of a first data word v read from said memory; means for adding the syndrome of a second data word v' to said first syndrome, said second data word v' being generated from said first data word v by means of an invert write and an invert read procedure in said memory, said addition providing a result which is independent of the position of said soft error; means for determining whether the result of said addition provides a syndrome of the single package type, in order to determine the specific package which has suffered at least one hard error; and means responsive to said determination for directly locating the positions of the errors, and for correcting the data word.
 2. A digital error detection and correction apparatus according to claim 1 further including:storage means having an address bus which has a first field receiving the value of the result of said addition, and a second field receiving the value of the number of the package having suffered at least a hard error; said storage generating, in response to a given address, a data word representative of the position of at least one erroneous bit.
 3. A digital error detection and correction apparatus according to claim 2 further including:a set of XOR gates each of said XOR gates having a first input connected to one bit of the data word to be corrected; and means controlled by said data bus of said storage in order to produce an inversion of a determined bit, the position of which has suffered one error, through a bit position correction signal supplied to a second input of said XOR gates.
 4. A digital error detection and correction apparatus according to claim 1 in which said error correcting code is a Reed-Solomon code having an H matrix of the type:

    ______________________________________                                         I   I     I     I   I   I     I     I     I    O    O                          I   T     T.sup.2                                                                              T.sup.3                                                                            T.sup.4                                                                            T.sup.5                                                                              T.sup.6                                                                              T.sup.7                                                                              O    I    O                          I   T.sup.2                                                                              T.sup.4                                                                              T.sup.6                                                                            T.sup.8                                                                            T.sup.10                                                                             T.sup.12                                                                             T.sup.14                                                                             O    O    I,                         ______________________________________                                    

with I being an identity matrix, O being a null matrix and with T being a companion matrix of a primitive element of a Galois Field GF(2^(b)).
 5. A digital error detection and correction apparatus according to claim 4 in which said T matrix is of the type:

    ______________________________________                                         0001                                                                           1000                                                                           0100                                                                           
 0011.                                                                         ______________________________________                                    


6. A digital error detection and correction apparatus according to claim 4 in which said T matrix is of the type:

    ______________________________________                                         0001                                                                           1001                                                                           0100                                                                           
 0010.                                                                         ______________________________________                                    


7. A digital error detection and correction apparatus according to claim 4 in which said T matrix is of the type:

    ______________________________________                                         0 0 1                                                                          1 0 1                                                                           1
 0.                                                                          ______________________________________                                    


8. A digital error detection and correction apparatus according to claim 4 in which said T matrix is of the type:
 9. A digital error detection and correction apparatus according to claim 1 in which said data word comprises a field of 32 data bits and a second field of 12 ECC bits.

    ______________________________________                                         0 0 1                                                                          1 0 0                                                                           0 1
 1.                                                                        ______________________________________                                    


10. A method for digital error detection and correction for an n-bit data word stored in a memory of an information processing system, said data word comprising a field of n-r data bits and a field of r error correcting code bits according to an error correcting code, said n-bit data word being organized in packages of b bits, said code being capable of correcting at lease one error in one package having suffered at least one hard failure and a single soft error in a different package, said method comprising the steps of:generating with said code a first syndrome when said data word has suffered a first error coming from at least one error in a first package and a single error in a second package, said second package being different from said first package, said code giving a second syndrome when said data word has suffered a second error coming from at least one error in said first package and a single error in a third package, said error correcting code also being such that the quality of said first and second syndromes results in the equality of said first and second errors: storing the syndrome of a first word v read from said memory; adding the syndrome of a second data word v' to the syndrome of word v, said word v' being generated from said data word v by means of an invert-write and an invert-read memory operation, said addition providing a result which is independent of the position of said soft error; determining whether the result of said addition provides a syndrome of the single package type, in order to determine the specific package which has suffered a hard error; and determining the positions of errors at least in said specific package and correcting the data word.
 11. The method of claim 10 in which said first determining step is carried out with a storage means having an address bus which has a first field receiving the value of the result of said addition, and a second field receiving the value of the number of the package having suffered at least a hard error, said storage means generated, in a response to a given address, a data word representative of the position of at least one erroneous bit.
 12. The method of claim 11 in which said error correcting code is a Reed-Solomon code having an H matrix of the type:

    ______________________________________                                         I   I     I     I   I   I     I     I     I    O    O                          I   T     T.sup.2                                                                              T.sup.3                                                                            T.sup.4                                                                            T.sup.5                                                                              T.sup.6                                                                              T.sup.7                                                                              O    I    O                          I   T.sup.2                                                                              T.sup.4                                                                              T.sup.6                                                                            T.sup.8                                                                            T.sup.10                                                                             T.sup.12                                                                             T.sup.14                                                                             O    O    I,                         ______________________________________                                          with I being an identity matrix, O being a null matrix and with T being a      companion matrix of a primitive element of a Galois Field GF( 2.sup.b).


13. The method of claim 12 in which said T matrix is of the type:

    ______________________________________                                         0001                                                                           1000                                                                           0100                                                                           
 0011.                                                                         ______________________________________                                    


14. The method of claim 13 in which said T matrix is of the type:

    ______________________________________                                         0001                                                                           1001                                                                           0100                                                                           
 0010.                                                                         ______________________________________                                    


15. The method of claim 14 in which said data word comprises a field of 32 data bits and a second field of 12 ECC bits.
 16. The method of claim 15 in which said T matrix is of the type:

    ______________________________________                                         0 0 1                                                                          1 0 1                                                                           0 1
 0.                                                                        ______________________________________                                    


17. The method of claim 16 in which said T matrix is of the type:

    ______________________________________                                         0 0 1                                                                          1 0 0                                                                           0 1
 1.                                                                        ______________________________________                                     